Complementable and Noncomplementable Host Adaptation Defects in Bipartite Geminiviruses
نویسندگان
چکیده
منابع مشابه
Countably Complementable Linear Orderings
We say that a countable linear ordering L is countably complementable if there exists a linear ordering L, possibly uncountable, such that for any countable linear ordering B, L does not embed into B if and only if B embeds into L. We characterize the linear orderings which are countably complementable. We also show that this property is equivalent to the countable version of the finitely faith...
متن کاملAdaptation and enslavement in endosymbiont-host associations.
The evolutionary persistence of symbiotic associations is a puzzle. Adaptation should eliminate cooperative traits if it is possible to enjoy the advantages of cooperation without reciprocating-a facet of cooperation known in game theory as the Prisoner's Dilemma. Despite this barrier, symbioses are widespread and may have been necessary for the evolution of complex life. The discovery of strat...
متن کاملAdam: Identifying defects in context-aware adaptation
Context-aware applications, as a typical type of self-adaptive software systems, are receiving increasing attention. These applications continually adapt to environmental changes in an autonomic way. However, their adaptation may contain defects when the complexity of modeling all environmental changes is beyond a developer’s ability. Such defects can cause failure to the adaptation and result ...
متن کاملMultitasking in replication is common among geminiviruses.
Geminiviruses package single-stranded circular DNA and replicate via double-stranded DNA intermediates. During the past decade, increasing evidence has led to the general acceptance that their replication follows a rolling-circle replication mechanism like bacteriophages with single-stranded DNA. In a recent study, we showed that this is also true for Abutilon mosaic geminivirus (AbMV), but tha...
متن کاملZarankiewicz Numbers and Bipartite Ramsey Numbers
The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Virology
سال: 1995
ISSN: 0042-6822
DOI: 10.1006/viro.1995.1481